Fluid limits for many-server systems with reneging
نویسندگان
چکیده
A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by Kaspi and Ramanan, the Law-of-Large-Numbers many-server asymptotics are characterized as the unique solution to a set of differential equations in a measure space, regarded as fluid model equations. In stationarity, convergence to the explicitly solved invariant state of the fluid model equations is established. An immediate consequence of the results in the case of exponential reneging is the asymptotic optimality of an index policy, called the cμ/θ rule, for the problem of minimizing linear queue-length and reneging costs. A certain Skorohod map plays an important role in obtaining both uniqueness of solutions to the fluid model equations, and convergence. AMS subject classifications: 60K25, 60F17, 68M20
منابع مشابه
Fluid Limits of Many-servers Queues with Reneging
This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if the time before possible entry into service exceeds the patience time. The dynamics of the system is represented in terms of a pair of measure-valued process...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملAnalysis of Finite Buffer Markovian Queue with Balking, Reneging and Working Vacations
This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...
متن کامل